Path-length analysis for grid-based path planning

PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...

The Grid-Based Path Planning Competition

A large number of papers have been written that deal with path planning in grids. These papers contain a wide variety of techniques and operate under a wide variety of constraints. All of them offer significant improvement over and beyond a basic A* search. But there has been no unified study comparing techniques and measuring the trade-offs implicit in the approaches. While this comparison cou...

Grid-Based Angle-Constrained Path Planning

Square grids are commonly used in robotics and game development as spatial models and well known in AI community heuristic search algorithms (such as A*, JPS, Theta* etc.) are widely used for path planning on grids. A lot of research is concentrated on finding the shortest (in geometrical sense) paths while in many applications finding smooth paths (rather than the shortest ones but containing ...

Accelerated A* Trajectory Planning: Grid-based Path Planning Comparison

The contribution of the paper is a high performance pathplanning algorithm designed to be used within a multi-agent planning framework solving a UAV collision avoidance problem. Due to the lack of benchmark examples and available algorithms for 3D+time planning, the algorithm performance has been compared in the classical domain of path planning in grids with blocked and unblocked cells. The Ac...

Grid-Based Path-Finding